Solving Integrated Process Planning, Dynamic Scheduling, and Due Date Assignment Using Metaheuristic Algorithms

Solving Fleet Scheduling Problem using Metaheuristic Algorithms

Solving Weighted Number of Operation Plus Processing Time Due-Date Assignment, Weighted Scheduling and Process Planning Integration Problem Using Genetic and Simulated Annealing Search Methods

Traditionally, the three important manufacturing functions, which are process planning, scheduling and due-date assignment, are performed separately and sequentially. For couple of decades, hundreds of studies are done on integrated process planning and scheduling problems and numerous researches are performed on scheduling with due date assignment problem, but unfortunately the integration of ...

Solving Integrated Process Planning and Scheduling Problem with Constraint Programming

Process planning and scheduling are two important manufacturing functions which are usually performed sequentially. However, due to the uncertainties and disturbances frequently occurring in the manufacturing environment, the separately conducted process plan and shopfloor schedule may lose their optimality, becoming ineffective or even infeasible. Researchers have considered the potential of i...

Genetic algorithms in integrated process planning and scheduling

This paper presents a review of genetic algorithms in integrated process planning and scheduling problems. According to the literature information, process planning and scheduling are two functions that were sequentially carried out in a manufacturing system, where scheduling was performed after process plans had been generated. Their integration highly improves the performance and efficiency o...

Due-date assignment and parallel-machine scheduling with deteriorating jobs

In this paper we study the problem of scheduling n deteriorating jobs on m identical parallel machines. Each job’s processing time is a nondecreasing function of its start time. The problem is to determine an optimal combination of the due-date and schedule so as to minimize the sum of the due-date, earliness and tardiness penalties. We show that this problem is NP-hard, and we present a heuris...